Analysis of a Greedy Reconstruction Algorithm
نویسندگان
چکیده
Related DatabasesWeb of Science You must be logged in with an active subscription to view this.Article DataHistorySubmitted: 13 October 2020Accepted: 11 June 2021Published online: 29 November 2021KeywordsHamiltonian identification, operator reconstruction, quantum control problems, inverse greedy reconstruction algorithmAMS Subject Headings65K10, 81Q93, 34A55, 49N10, 49N45Publication DataISSN (print): 0363-0129ISSN (online): 1095-7138Publisher: Society for Industrial and Applied MathematicsCODEN: sjcodc
منابع مشابه
Probabilistic analysis of the greedy algorithm
It is shown that the greedy algorithm in the average case (in some probabilistic model) finds almost minimum covers. It is shown also that in the average case the ratio of the size of minimum cover to the size of minimum fractional cover has logarithmic order in the size of the ground set.
متن کاملSparse Signals Reconstruction via Adaptive Iterative Greedy Algorithm
Compressive sensing(CS) is an emerging research field that has applications in signal processing, error correction, medical imaging, seismology, and many more other areas. CS promises to efficiently reconstruct a sparse signal vector via a much smaller number of linear measurements than its dimension. In order to improve CS reconstruction performance, this paper present a novel reconstruction g...
متن کاملa swot analysis of the english program of a bilingual school in iran
با توجه به جایگاه زبان انگلیسی به عنوان زبانی بین المللی و با در نظر گرفتن این واقعیت که دولت ها و مسئولان آموزش و پرورش در سراسر جهان در حال حاضر احساس نیاز به ایجاد موقعیتی برای کودکان جهت یاد گیری زبان انگلیسی درسنین پایین در مدارس دو زبانه می کنند، تحقیق حاضر با استفاده از مدل swot (قوت ها، ضعف ها، فرصتها و تهدیدها) سعی در ارزیابی مدرسه ای دو زبانه در ایران را دارد. جهت انجام این تحقیق در م...
15 صفحه اولGreedy Algorithm for the Analysis Transform Domain
Many signal and image processing applications have benefited remarkably from the theory of sparse representations. In the classical synthesis model, the signal is assumed to have a sparse representation under a given known dictionary. The algorithms developed for this framework mainly operate in the representation domain. Recently, a new model has been introduced, the cosparse analysis one, in ...
متن کاملClustering Analysis based on Greedy Heuristic Algorithm
Due to increase of the mining of compressed data from various types of applications. Clustering is the process for resolving that type of applications. Traditionally we are using different clustering applications for grouping elements with equal priority. And we represent single clustering process with multi dimensional data grouping using clustering but the only problem is performance of group...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Siam Journal on Control and Optimization
سال: 2021
ISSN: ['0363-0129', '1095-7138']
DOI: https://doi.org/10.1137/20m1373384